[Proceeding] Fast and Robust EM-Based IRLS Algorithm for Sparse Signal Recovery from Noisy Measurements
نویسندگان
چکیده
In this paper, we analyze a new class of iterative re-weighted least squares (IRLS) algorithms and their effectiveness in signal recovery from incomplete and inaccurate linear measurements. These methods can be interpreted as the constrained maximum likelihood estimation under a two-state Gaussian scale mixture assumption on the signal. We show that this class of algorithms, which performs exact recovery in noiseless scenarios under suitable assumptions, is robust even in presence of noise. Moreover these methods outperform classical IRLS for `τ -minimization with τ ∈ (0, 1] in terms of accuracy and rate of convergence.
منابع مشابه
Convergence and Stability of a Class of Iteratively Re-weighted Least Squares Algorithms for Sparse Signal Recovery in the Presence of Noise.
In this paper, we study the theoretical properties of a class of iteratively re-weighted least squares (IRLS) algorithms for sparse signal recovery in the presence of noise. We demonstrate a one-to-one correspondence between this class of algorithms and a class of Expectation-Maximization (EM) algorithms for constrained maximum likelihood estimation under a Gaussian scale mixture (GSM) distribu...
متن کاملOn recovery of block-sparse signals via mixed l2/lq (0 < q ¿ 1) norm minimization
Compressed sensing (CS) states that a sparse signal can exactly be recovered from very few linear measurements. While in many applications, real-world signals also exhibit additional structures aside from standard sparsity. The typical example is the so-called block-sparse signals whose non-zero coefficients occur in a few blocks. In this article, we investigate the mixed l2/lq(0 < q ≤ 1) norm ...
متن کاملConvergence and Stability of Iteratively Re-weighted Least Squares Algorithms for Sparse Signal Recovery in the Presence of Noise
In this paper, we study the theoretical properties of a class of iteratively re-weighted least squares (IRLS) algorithms for sparse signal recovery in the presence of noise. We demonstrate a one-toone correspondence between this class of algorithms and a class of Expectation-Maximization (EM) algorithms for constrained maximum likelihood estimation under a Gaussian scale mixture (GSM) distribut...
متن کاملConjugate gradient acceleration of iteratively re-weighted least squares methods
Iteratively Re-weighted Least Squares (IRLS) is a method for solving minimization problems involving non-quadratic cost functions, perhaps non-convex and non-smooth, which however can be described as the infimum over a family of quadratic functions. This transformation suggests an algorithmic scheme that solves a sequence of quadratic problems to be tackled efficiently by tools of numerical lin...
متن کاملA New IRIS Segmentation Method Based on Sparse Representation
Iris recognition is one of the most reliable methods for identification. In general, itconsists of image acquisition, iris segmentation, feature extraction and matching. Among them, iris segmentation has an important role on the performance of any iris recognition system. Eyes nonlinear movement, occlusion, and specular reflection are main challenges for any iris segmentation method. In thi...
متن کامل